Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models
نویسندگان
چکیده
منابع مشابه
Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models
Full terms and conditions of use:
متن کاملDiscrete Endogenous Variables in Weakly Separable Models
This paper contains an extension of the identification method proposed in Jun, Pinkse, and Xu (2009, JPX), which is based on a generated collection of sets, i.e. a Dynkin system. We demonstrate the usefulness of this extension in the context of the model proposed by Vytlacil and Yıldız (2007, VY). VY formulate a fully nonparametric model featuring a nested weakly separable structure in which an...
متن کاملOptimization-Based Stabilization of Sampled-Data Nonlinear Systems via Their Approximate Discrete-Time Models
We present results on numerical regulator design for sampled-data nonlinear plants via their approximate discrete-time plant models. The regulator design is based on an approximate discrete-time plant model and is carried out either via an infinite horizon optimization problem or via a finite horizon with terminal cost optimization problem. In both cases we discuss situations when the sampling ...
متن کاملLearning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
We propose the use of sequences of separable, piecewise linear approximations for solving nondifferentiable stochastic optimization problems. The approximations are constructed adaptively using a combination of stochastic subgradient information and possibly sample information on the objective function itself. We prove the convergence of several versions of such methods when the objective funct...
متن کاملDiscrete Optimization with Decision Diagrams
We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, while restricted BDDs supply a primal heuristic. Each problem is given a dynamic programming model that allows one to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 2014
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.2013.1772